The simplicity of planar networks

نویسندگان

  • Matheus P. Viana
  • Emanuele Strano
  • Patricia Bordin
  • Marc Barthelemy
چکیده

Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns--the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a non trivial and non local information about the spatial organization of these graphs. We define the simplicity index as the average ratio of these lengths and the simplicity profile characterizes the simplicity at different scales. We measure these metrics on artificial (roads, highways, railways) and natural networks (leaves, slime mould, insect wings) and show that there are fundamental differences in the organization of urban and biological systems, related to their function, navigation or distribution: straight lines are organized hierarchically in biological cases, and have random lengths and locations in urban systems. In the case of time evolving networks, the simplicity is able to reveal important structural changes during their evolution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

متن کامل

Forward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning

The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...

متن کامل

Using a Neural Network instead of IKM in 2R Planar Robot to follow rectangular path

Abstract— An educational platform is presented here for the beginner students in the Simulation and Artificial Intelligence sciences. It provides with a start point of building and simulation of the manipulators, especially of 2R planar Robot. It also displays a method to replace the inverse kinematic model (IKM) of the Robot with a simpler one, by using a Multi-Layer Perceptron Neural Network ...

متن کامل

UWB Planar Conical Horn-Shaped Self-Complementary Bow-Tie Antenna

An ultra-wideband (UWB) self-complementary planar bow-tie antenna (SCPBTA) is proposed. The antenna consists of a printed conical horn-shaped (CHS) radiator and a counterpart CHS slot etched on a rectangular ground plane. The printed CHS radiator is connected directly to the 50Ω microstrip line by bending the end portion of the feed line. As a result, the antenna has a simple structure which do...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2013